Reliable Spanners for Metric Spaces
نویسندگان
چکیده
A spanner is reliable if it can withstand large, catastrophic failures in the network. More precisely, any failure of some nodes only cause a small damage remaining graph terms dilation, that is, property maintained for almost all residual graph. Constructions spanners near linear size are known low-dimensional Euclidean settings. Here, we present new constructions planar graphs, trees and (general) metric spaces.
منابع مشابه
t-Spanners for metric space searching
The problem of Proximity Searching in Metric Spaces consists in finding the elements of a set which are close to a given query under some similarity criterion. In this paper we present a new methodology to solve this problem, which uses a t-spanner G′(V,E) as the representation of the metric database. A t-spanner is a subgraph G′(V,E) of a graph G(V,A), such that E ⊆ A and G′ approximates the s...
متن کاملOn metric spaces induced by fuzzy metric spaces
For a class of fuzzy metric spaces (in the sense of George and Veeramani) with an H-type t-norm, we present a method to construct a metric on a fuzzy metric space. The induced metric space shares many important properties with the given fuzzy metric space. Specifically, they generate the same topology, and have the same completeness. Our results can give the constructive proofs to some probl...
متن کاملPractical Construction of Metric t - Spanners ∗ Gonzalo
Let G(V,A) be a connected graph with a nonnegative cost function d : A → R. Let dG(u, v) be the cost of the cheapest path between u, v ∈ V . A tspanner of G is a subgraph G(V,E), E ⊆ A, such that ∀ u, v ∈ V, dG′(u, v) ≤ t · dG(u, v), t > 1. We focus on the metric space context, which means that A = V ×V , d is a metric, and t ≤ 2. Several algorithms to build t-spanners are known, but they do no...
متن کاملt-Spanners as a Data Structure for Metric Space Searching
A t-spanner, a subgraph that approximates graph distances within a precision factor t, is a well known concept in graph theory. In this paper we use it in a novel way, namely as a data structure for searching metric spaces. The key idea is to consider the t-spanner as an approximation of the complete graph of distances among the objects, and use it as a compact device to simulate the large matr...
متن کاملAxioms for Moore Spaces and Metric Spaces
for an arbitrary original polygon P . Further, no other relations Pn_p = 0 (p7*pi or p2 • or £jfc) are satisfied by P ' if P remains general ( P ' has no higher than the &th degree of regularity). This is also seen from (16'), where 0(co) ^ 0 , Rn-P^0 (since P is general) ; therefore P ' n _ ^ 0 . In fact, no relations of any kind besides (18) are satisfied by P' = MP if P remains general. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2023
ISSN: ['1549-6333', '1549-6325']
DOI: https://doi.org/10.1145/3563356